Model Checking Russian Cards
نویسندگان
چکیده
We implement a specific protocol for bit exchange among card-playing agents in three different state-of-the-art epistemic model checkers and compare the results.
منابع مشابه
Logic Column 19: Symbolic Model Checking for Temporal-Epistemic Logics
In this issue, Lomuscio and Penczek survey some of the recent work in verification of temporalepistemic logic via symbolic model checking, focussing on OBDD-based and SAT-based approaches for epistemic logics built on discrete and real-time branching time temporal logics. On this topic, I should mention the following paper, which compares several model checkers for epistemic logics with a tempo...
متن کاملModel Checking A Knowledge Exchange Scenario
We are interested in applying model checking techniques to the verification of communication protocols which require safe communication. Typically, in such scenarios, one desires to demonstrate that one party can reliably communicate information to another party without a third party being able to determine this information. Our approach involves using the modal logic of knowledge, which has on...
متن کاملThree Steps
Given is a deal of ten cards over three players, such that two players each get four cards and the remaining player (the ‘eavesdropper’) two cards. We show that there does not exist a protocol of two steps for the four-card players to inform each other safely of their hands of cards, and we then present a protocol of three steps that achieves that goal. We verify the properties of that protocol...
متن کاملA Zero-Error Source Coding Solution to the Russian Cards Problem
In the Russian Cards problem, Alice wants to communicate her hand from a deck of cards to Bob through one public announcement such that Cath does not learn her hand. In zero-error source coding, Alice’s goal is to communicate her information to Bob with the least amount of bits. Both problems share the goal of Bob learning Alice’s information in one announcement. However, they have additional o...
متن کاملThe Use of Formal Methods for Smart Cards, a Comparison between B and SDL to Model the T= 1 Protocol
In order to obtain high confidence in the software embedded into a smart card, we evaluated different techniques like model checking and theorem proving. Nevertheless due to the low cost of smart cards and mechanical constraints, the amount of memory available on chips is small. The code generated by the tools must be compact enough to fit the constraints. In this paper we compare different cod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 149 شماره
صفحات -
تاریخ انتشار 2006